On 4-Map Graphs and 1-Planar Graphs and their Recognition Problem
نویسنده
چکیده
We establish a one-to-one correspondence between 1-planar graphs and general and hole-free 4-map graphs and show that 1-planar graphs can be recognized in polynomial time if they are crossing-augmented, fully triangulated, and maximal 1-planar, respectively, with a polynomial of degree 120, 3, and 5, respectively.
منابع مشابه
$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کاملLinear-Time Recognition of Map Graphs with Outerplanar Witness
Map graphs generalize planar graphs and were introduced by Chen, Grigni and Papadimitriou [STOC 1998, J.ACM 2002]. They showed that the problem of recognizing map graphs is in NP by proving the existence of a planar witness graph W . Shortly after, Thorup [FOCS 1998] published a polynomial-time recognition algorithm for map graphs. However, the run time of this algorithm is estimated to be Ω(n1...
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملMap Graphs in Polynomial Time
Chen,Grigni, andPapadimitriou (WADS’97 andSTOC’98) have introduced a modified notion of planarity, where two faces are considered adjacent if they share at least one point. The corresponding abstract graphs are called map graphs. Chen et.al. raised the question of whether map graphs can be recognized in polynomial time. They showed that the decision problem is in NP and presented a polynomial t...
متن کاملOn the Total Number of Bends for Planar Octilinear Drawings
An octilinear drawing of a planar graph is one in which each edge is drawn as a sequence of horizontal, vertical and diagonal at 45◦ line-segments. For such drawings to be readable, special care is needed in order to keep the number of bends small. As the problem of finding planar octilinear drawings of minimum number of bends is NP-hard [16], in this paper we focus on upper and lower bounds. F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1509.03447 شماره
صفحات -
تاریخ انتشار 2015